An induction principle and pigeonhole principles for K-finite sets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Induction Principle and Pigeonhole Principles for K-Finite Sets

We establish a course-of-values induction principle for K-finite sets in intuitionistic type theory. Using this principle, we prove a pigeonhole principle conjectured by Bénabou and Loiseau. We also comment on some variants of this pigeonhole principle.

متن کامل

development and implementation of an optimized control strategy for induction machine in an electric vehicle

in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...

15 صفحه اول

The Pigeonhole Principle

Theorem 1.1. If n + 1 objects are put into n boxes, then at least one box contains two or more objects. Proof. Trivial. Example 1.1. Among 13 people there are two who have their birthdays in the same month. Example 1.2. There are n married couples. How many of the 2n people must be selected in order to guarantee that one has selected a married couple? Other principles related to the pigeonhole ...

متن کامل

The Topological Pigeonhole Principle for Ordinals

Given a cardinal κ and a sequence (αi )i∈κ of ordinals, we determine the least ordinal (when one exists) such that the topological partition relation

متن کامل

Degree complexity for a modified pigeonhole principle

We consider a modiication of the pigeonhole principle, MPHP, introduced by Goerdt in 7]. Using a technique of Razborov 9] and simpliied by Impagliazzo, Pudll ak and Sgall 8], we prove that any Polynomial Calculus refutation of a set of polynomials encoding the MPHP, requires degree (log n). We also prove that the this lower bound is tight, giving Polynomial Calculus refutations of MPHP of optim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Symbolic Logic

سال: 1995

ISSN: 0022-4812,1943-5886

DOI: 10.2307/2275881